Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
231	BRICS DS-04-5 B. Skjernaa: Exact Algorithms for Variants of Satisfiability and Colouring Problems BRICS Basic Research in Computer Science Add to Reading List Source URL: www.brics.dk Language: English - Date: 2005-04-05 15:07:30 NP-complete problems Boolean satisfiability problem NP-complete Satisfiability Maximum cut Algorithm Graph coloring 2-satisfiability Theoretical computer science Mathematics Applied mathematics
232	Vertex Cover Gets Faster and Harder on Low Degree Graphs Akanksha Agrawal1 , Sathish Govindarajan1 , Neeldhara Misra1 Indian Institute of Science, Bangalore {akanksha.agrawal\|gsat\|neeldhara}@csa.iisc.ernet.in Add to Reading List Source URL: drona.csa.iisc.ernet.in Language: English - Date: 2014-08-01 08:33:48 NP-complete problems Vertex cover Vertex Graph Hamiltonian path Tree Clique Neighbourhood Connectivity Graph theory Mathematics Theoretical computer science
233	KaHIP v0.71 – Karlsruhe High Quality Partitioning User Guide Peter Sanders and Christian Schulz Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany Email: {sanders, christian.schulz}@kit.edu Add to Reading List Source URL: algo2.iti.kit.edu Language: English - Date: 2015-01-03 02:07:55 Graph Graph coloring Planar separator theorem Path decomposition Graph theory NP-complete problems Graph partition
234	Kannan and Wheeler Algorithms for Molecular Biology 2012, 7:9 http://www.almob.org/contentRESEARCH Open Access Add to Reading List Source URL: www.almob.org Language: English Phylogenetics NP-complete problems Graph Maximum parsimony Routing algorithms Tree Phylogenetic network Steiner tree problem Directed acyclic graph Graph theory Mathematics Theoretical computer science
235	An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem Arash Asadpour∗ ‡ Michel X. Goemans† Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2009-10-28 12:34:47 Spanning tree Loop-erased random walk Minimum spanning tree Chernoff bound Eulerian path NP-complete problems Dominating set Tutte polynomial Graph theory Mathematics Theoretical computer science
236	Tree-based Coarsening and Partitioning of Complex Networks Roland Glantz, Henning Meyerhenke, and Christian Schulz arXiv:1402.2782v2 [cs.DS] 13 Feb 2014 Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-02-13 20:08:15 Graph connectivity Combinatorial optimization Spanning tree NP-complete problems Graph partition Vertex Minimum spanning tree Edge contraction Tree Graph theory Mathematics Theoretical computer science
237	CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () HW#3 – Due at the beginning of class ThursdayConsider a model of a nonbipartite undirected graph in which two partic Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:42:07 NP-complete problems Clique problem Vertex cover Matching Eulerian path Clique Minimum spanning tree Randomized algorithm Connectivity Graph theory Theoretical computer science Mathematics
238	6.889 — Lecture 15: Traveling Salesman (TSP) Christian Sommer (figures by Philip Klein) November 2, 2011 Traveling Salesman Problem (TSP) given G = (V, E) find a tour visiting each1 node v ∈ V . NP–har Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-11-29 11:50:24 Spanning tree NP-complete problems Operations research Travelling salesman problem Graph operations Minimum spanning tree Graph Planar graph Eulerian path Graph theory Theoretical computer science Mathematics
239	PDF Document Add to Reading List Source URL: web.eecs.umich.edu Language: English - Date: 2014-02-11 03:59:44 Combinatorial optimization NP-complete problems Matching Cut Shortest path problem Time complexity Maximum cut Travelling salesman problem Hungarian algorithm Theoretical computer science Graph theory Mathematics
240	BRICS Basic Research in Computer Science BRICS RSJ. M. Nielsen: On the Number of Maximal Independent Sets in a Graph On the Number of Maximal Independent Sets Add to Reading List Source URL: www.brics.dk Language: English - Date: 2002-04-12 04:11:55 NP-complete problems Maximal independent set Independent set Graph coloring Clique Extremal graph theory Domatic number Path decomposition Graph theory Theoretical computer science Mathematics

UPDATE